#include <stdio.h>
#include <stdlib.h>

#define MAX 2001

int f[MAX];
int kind[MAX];

int n, m;
int testcase;

void init()
{
    int i;
    for (i = 1; i <= n; i++) {
        f[i] = i;
        kind[i] = 0;
    }
}

int find(int n)
{
    if (f[n] == n) {
        return n;
    } 

    int t = find(f[n]);
    kind[n] = (kind[n] + kind[f[n]]) % 2;
    f[n] = t;
    
    return f[n];
}

int merge(int x, int y)
{
    int a = find(x);
    int b = find(y);

    if (a == b) {
        if (kind[x] == kind[y]) {
            return 1;
        }
    } else {
        f[a] = b;
        kind[a] = (kind[x] + kind[y] + 1) % 2;
    }

    return 0;
}

int main (int argc, char const* argv[])
{
    int i, j, a, b, flag;

    scanf("%d", &testcase);

    for (i = 1; i <= testcase; i++) {
        flag = 0;
        scanf("%d %d", &n, &m);
        init();
        for (j = 1; j <= m; j++) {
            scanf("%d %d", &a, &b);
            if (merge(a, b)) {
                flag = 1;
            }
        }

        if (flag == 1) {
            printf("Scenario #%d:\nSuspicious bugs found!\n\n", i);
        } else {
            printf("Scenario #%d:\nNo suspicious bugs found!\n\n", i);
        }
    }

    return 0;
}
